Learnability : Basic Definitions , Examples , Results
نویسندگان
چکیده
The notion of learnability plays a central role in learning theory and continues to be an active topic of study. As noted in the last lecture, it is related to the notion of statistical consistency, with origins in theoretical computer science. Over the next few lectures, we will study various models of learnability related to the probably approximately correct (PAC) learning model introduced in the seminal work of Valiant [7]. We will begin in this lecture with some basic definitions and results, and illustrate with more results and examples in the next few lectures.
منابع مشابه
A generalization of the PAC learning in product probability spaces
Three notions dependent theory, VC-dimension, and PAC-learnability have been found to be closely related. In addition to the known relation among these notions in model theory, finite combinatorics and probability theory, Chernikov, Palacin, and Takeuchi found a relation between n-dependence and VCn-dimension, which are generalizations of dependence and VC-dimension respectively. We are now wor...
متن کاملProbabilistic learnability of context-free grammars with basic distributional properties from positive examples
Article history: Available online xxxx
متن کاملA bottom-up efficient algorithm learning substitutable languages from positive examples
Based on Harris’s substitutability criterion, the recent definitions of classes of substitutable languages have led to interesting polynomial learnability results for expressive formal languages. These classes are also promising for practical applications: in natural language analysis, because definitions have strong linguisitic support, but also in biology for modeling protein families, as sug...
متن کاملCS 269 : Machine Learning Theory
The idea behind boosting is to construct an accurate hypothesis from a set of hypotheses that are each guaranteed to perform slightly better than random guessing on particular distributions of data. This idea originally arose from attempts to prove the robustness of the PAC model. By robustness, we mean the notion that slight alterations to the model definitions should not result in dramaticall...
متن کاملD.Béchet A.Foret
This paper investigates the learnability by positive examples in the sense of Gold of Pregroup Grammars. In a first part, Pregroup Grammars are presented and a new parsing strategy is proposed. Then, theoretical learnability and non-learnability results for subclasses of Pregroup Grammars are proved. In the last two parts, we focus on learning Pregroup Grammars from a special kind of input call...
متن کامل